Groups of even type which are not of even characteristic, I
نویسندگان
چکیده
منابع مشابه
Finite groups have even more centralizers
For a finite group $G$, let $Cent(G)$ denote the set of centralizers of single elements of $G$. In this note we prove that if $|G|leq frac{3}{2}|Cent(G)|$ and $G$ is 2-nilpotent, then $Gcong S_3, D_{10}$ or $S_3times S_3$. This result gives a partial and positive answer to a conjecture raised by A. R. Ashrafi [On finite groups with a given number of centralizers, Algebra Collo...
متن کاملInvestigation on Groups of Even Order, I.
1. Let G be a group of finite order g and let U be a subgroup of order g. If f is a complex-valued class function defined on G, i.e. a function whose value remains constant on each of the conjugate classes K1, K2, . . . K, of G, then f can be expressed by the values of the irreducible characters xi, X2, . . *, Xk of G. If we can find a class function f on G, a class function f on G, and an elem...
متن کاملLusztig’s conjecture for finite classical groups with even characteristic
The determination of scalars involved in Lusztig’s conjecture concerning the characters of finite reductive groups was achieved by Waldspurger in the case of finite classical groups Sp2n(Fq) or On(Fq) when p, q are large enough. Here p is the characteristic of the finite field Fq . In this paper, we determine the scalars in the case of Sp2n(Fq) with p = 2, by applying the theory of symmetric sp...
متن کاملEven Accelerating Machines are Not Universal
We draw an analogy between Godel's Incompleteness Theorem in mathematics, and the impossibility of achieving a Universal Computer in computer science. Speci cally, Godel proved that there exist formal systems of mathematics that are consistent but not complete. In the same way, we show that there does not exist a general-purpose computer that is universal in the sense of being able to simulat...
متن کاملSome properties are not even partially testable
For a property P and a sub-property P , we say that P is P -partially testable with q queries if there exists an algorithm that distinguishes, with high probability, inputs in P ′ from inputs ǫ-far from P by using q queries. There are natural properties that require many queries to test, but can be partitioned into a small number of subsets for which they are partially testable with very few qu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2016
ISSN: 0021-2172,1565-8511
DOI: 10.1007/s11856-016-1313-x